N ov 2 00 8 A Central Limit Theorem , and related results , for a two - color randomly reinforced urn
نویسنده
چکیده
We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.
منابع مشابه
2 00 9 A Central Limit Theorem , and related results , for a two - color randomly reinforced urn
We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.
متن کاملA pr 2 00 9 A Central Limit Theorem , and related results , for a two - color randomly reinforced urn
We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.
متن کاملA Gaussian process approximation for two-color randomly reinforced urns∗
The Pólya urn has been extensively studied and is widely applied in many disciplines. An important application is to use urn models to develop randomized treatment allocation schemes in clinical studies. As an extension of the Pólya urn, the randomly reinforced urn was recently proposed to optimize clinical trials in the sense that patients are assigned to the best treatment with probability co...
متن کاملCentral limit theorems for a hypergeometric randomly reinforced urn
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number of extracted balls of a certain color given the past is assumed to be hypergeometric. We prove some central limit theorems in the sense of stable convergence ...
متن کاملDynamics of an adaptive randomly reinforced urn
Adaptive randomly reinforced urn (ARRU) is a two-color urn model where the updating process is defined by a sequence of non-negative random vectors {(D1,n, D2,n);n ≥ 1} and randomly evolving thresholds which utilize accruing statistical information for the updates. Let m1 = E[D1,n] and m2 = E[D2,n]. In this paper we undertake a detailed study of the dynamics of the ARRU model. First, for the ca...
متن کامل